Iterative proportional scaling via decomposable submodels for contingency tables

نویسندگان

  • Yushi Endo
  • Akimichi Takemura
چکیده

We propose iterative proportional scaling (IPS) via decomposable submodels for maximizing likelihood function of a hierarchical model for contingency tables. In ordinary IPS the proportional scaling is performed by cycling through the members of the generating class of a hierarchical model. We propose to adjust more marginals at each step. This is accomplished by expressing the generating class as a union of decomposable submodels and cycling through the decomposable models. We prove convergence of our proposed procedure, if the amount of scaling is adjusted properly at each step. We also analyze the proposed algorithms around the maximum likelihood estimate (MLE) in detail. Faster convergence of our proposed procedure is illustrated by numerical examples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Iterative proportional scaling via decomposable submodels for contingency tables

We propose iterative proportional scaling (IPS) via decomposable submodels for maximizing likelihood function of a hierarchical model for contingency tables. In ordinary IPS the proportional scaling is performed by cycling through the elements of the generating class of a hierarchical model. We propose to adjust more marginals at each step. This is accomplished by expressing the generating clas...

متن کامل

Math 697 Iterative Proportional Scaling

The purpose of this project is to show observations taken from the Iterative Proportional Scaling algorithm when used with data taken from Hierarchical LogLinear Models. We show with empirical proof that the difference between decomposable and non-decomposable graph models used is not exceedingly different. For the purpose of this project we looked at the properties of the two, three, and four ...

متن کامل

The mode oriented stochastic search (MOSS) algorithm for log-linear models with conjugate priors

We describe a novel stochastic search algorithm for rapidly identifying regions of high posterior probability in the space of decomposable, graphical and hierarchical log-linear models. Our approach is based on the Diaconis-Ylvisaker conjugate prior for log-linear parameters. We discuss the computation of Bayes factors through Laplace approximations and the Bayesian iterative proportional fitti...

متن کامل

Techniques for generic probabilistic inversion

Simple algorithms for probabilistic inversion are proposed, based on iterative sample re-weighting. One of these, iterative proportional fitting (IP F), dates from the 1930's and has been studied extensively with regard to contingency tables. A new algorithm is shown to converge even when IP F is infeasible.

متن کامل

A Localization Approach to Improve Iterative Proportional Scaling in Gaussian Graphical Models

We discuss an efficient implementation of the iterative proportional scaling procedure in the multivariate Gaussian graphical models. We show that the computational cost can be reduced by localization of the update procedure in each iterative step by using the structure of a decomposable model obtained by triangulation of the graph associated with the model. Some numerical experiments demonstra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computational Statistics & Data Analysis

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2009